Flat Committed Join in Join

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flat Committed Join in Join 1 Roberto Bruni , Hernán Melgratti and Ugo Montanari

Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic nested negotiations with compensations. In this paper we show that flat cJoin processes (i.e. processes without sub-negotiations) can be encoded in the ordinary Join calculus by exploiting a distributed two-phase commit protocol. In particular, we first define a type system that singles out flat pr...

متن کامل

Flat Committed Join in Join 1 Roberto Bruni , Hernán Melgratti and Ugo

Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic nested negotiations with compensations. In this paper we show that flat cJoin processes (i.e. processes without sub-negotiations) can be encoded in ordinary Join calculus by exploiting a distributed two-phase commit protocol (D2PC). In particular, we first define a type system that singles out flat...

متن کامل

Join spaces , soft join spaces and lattices

The aim of this paper is to initiate and investigate new (soft) hyperstructures, particularly (soft) join spaces, using important classes of lattices: modular and distributive. They are used in order to study (soft) hyperstructures constructed on the set of all convex sublattices of a lattice.

متن کامل

Spatial Join

DEFINITION Spatial join operation is used to combine two or more datasets with respect to a spatial predicate. The predicate can be a combination of directional, distance, and topological spatial relations. In the case of nonspatial joins, the joining attributes must be of the same type, but for spatial joins they can be of different types. Usually each spatial attribute is represented by its m...

متن کامل

Join Constraints

Many application domains involve constraints that, at a conceptual modeling level, apply to one or more schema paths, each of which involves one or more conceptual joins (where the same conceptual object plays roles in two relationships). Popular information modeling approaches typically provide only weak support for such join constraints. This paper contrasts how join constraints are catered f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2004

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2004.09.021